Bounding the distance among longest paths in a connected graph
نویسندگان
چکیده
منابع مشابه
Intersection of Longest Paths in a Graph
In 1966, Gallai asked whether every connected graph has a vertex that is common to all its longest paths. The answer to this question is negative. We prove that the answer is positive for outerplanar graphs. Another related question was raised in 1995 at the British Combinatorial Conference: Do any three longest paths in a connected graph have a vertex in common? We prove that, in a connected g...
متن کاملLongest paths through an arc in strongly connected in-tournaments
An in-tournament is an oriented graph such that the in-neighborhood of every vertex induces a tournament. Recently, we have shown that every arc of a strongly connected tournament of order n is contained in a directed path of order r(n + 3)/21. This is no longer valid for strongly connected in-tournaments, because there exist examples containing an arc with the property that the longest directe...
متن کاملA note on longest paths in circular arc graph
As observed by Rautenbach and Sereni [SIAM J. Discrete Math. 28 (2014) 335–341] there is a gap in the proof of the theorem of Balister et al. [Combin. Probab. Comput. 13 (2004) 311–317], which states that the intersection of all longest paths in a connected circular arc graph is nonempty. In this paper we close this gap.
متن کاملComplexity of Distance Fraud Attacks in Graph-Based Distance Bounding
Distance bounding (DB) emerged as a countermeasure to the so-called relay attack, which affects several technologies such as RFID, NFC, Bluetooth, and Ad-hoc networks. A prominent family of DB protocols are those based on graphs, which were introduced in 2010 to resist both mafia and distance frauds. The security analysis in terms of distance fraud is performed by considering an adversary that,...
متن کاملOn Computing Longest Paths in Small Graph Classes
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigated, few graph classes are known to be solved efficiently for the longest path problem. For a tree, a simple linear time algorithm for the longest path problem is known. We first generalize the algorithm, and show that t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2018
ISSN: 0012-365X
DOI: 10.1016/j.disc.2017.09.029